Conflict Detection and Resolution in Air Traffic Management Based on Graph Coloring Problem Using Imperialist Competitive Algorithm

In aviation industry, considering more freedom in the selection and modification of flight paths during flight time is a new challenge, which is known as free flight. The free flight concept alters the current centralized and command-control airspace system (between air traffic controllers and pilots) to a distributed system that allows pilots choose their own flight paths more efficient and optimal, and also plan for their flight with high performance themselves. In spite of many advantages of free flight (such as less fuel consumption, minimum delays and the reduction of the workload of the air traffic control centers), the free flight concept cause many problems such as conflicts (collisions) between different aircrafts. Conflict detection and resolution is one of the major challenges in air traffic management system. In this paper, we present a novel model for conflict detection and resolution in air traffic management. Although so far many models have been proposed for the detection and resolution of conflicts, our model offers a prevention method. In addition, our model proposes a mechanism for resolving conflicts between aircrafts in airspace using graph coloring problem’s concept. In fact, we mapped the congestion area to a corresponding graph, and then addressed to find a reliable and optimal coloring method for this graph using one of the evolutionary algorithms known as Imperialist Competitive Algorithm (ICA) to solve the conflict problem. Using Imperialist Competitive Algorithm for solving graph coloring problem is a new method.